Cycle-symmetric matrices and convergent neural networks
نویسندگان
چکیده
This work investigates a class of neural networks with cycle-symmetric connection strength. We shall show that, by changing the coordinates, the convergence of dynamics by Fiedler and Gedeon [Physica D 111 (1998) 288] is equivalent to the classical results. This presentation also addresses the extension of the convergence theorem to other classes of signal functions with saturations. In particular, the result of Cohen and Grossberg [IEEE Trans. Syst. Man Cybernet. SMC-13 (1983) 815] is recast and extended with a more concise verification. © 2000 Elsevier Science B.V. All rights reserved. MSC: 34C37; 68T10; 92B20
منابع مشابه
Splittings of symmetric matrices and a question
7 A complete answer is given to a problem posed in 1988 by Ortega concerning convergent splittings of 8 symmetric matrices. 9 © 2008 Published by Elsevier Inc. 10 AMS classification: Primary 65F10; Secondary 15A 11
متن کاملProperties of Central Symmetric X-Form Matrices
In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.
متن کاملOn the Templates Corresponding to Cycle-Symmetric Connectivity in Cellular Neural Networks
In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which express the local interaction weights among cells. Recently, the complete stability for CNN has been extended from symmetric connections to cycle-symmetric connections. In this presentation, we investigate a class of temp...
متن کاملfor Neural Networks Based Approach Computing Eigenvectors and Eigenvalues of Symmetric Matrix
K e y w o r d s R e c u r r e n t neural networks, Eigenvalues, Eigenvectors, Eigenspace, Symmetric matrix. 1. I N T R O D U C T I O N C o m p u t i n g e igenvec to r s of a m a t r i x is a n i m p o r t a n t a n d i n t e r e s t i n g p r o b l e m in eng inee r ing , especially for computing eigenvectors corresponding to largest or smallest eigenvalues. There are many important applicatio...
متن کاملLower bounds for the spectral radius of a matrix
In this paper we develop lower bounds for the spectral radius of symmetric , skew{symmetric, and arbitrary real matrices. Our approach utilizes the well{known Leverrier{Faddeev algorithm for calculating the co-eecients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which states that the critical points of a polynomial lie within the convex hull of its roots....
متن کامل